Extending the Path Analysis Technique to Obtain a Soft WCET

نویسندگان

  • Paul Keim
  • Amanda Noyes
  • Andrew Ferguson
  • Joshua Neal
  • Christopher A. Healy
چکیده

1 Department of Computer Science, Furman University, Greenville SC 29613 USA; e-mail: [email protected] Abstract This paper discusses an efficient approach to statically compute a WCET that is “soft” rather than “hard”. The goal of most timing analysis is to determine a guaranteed WCET; however this execution time may be far above the actual distribution of observed execution times. A WCET estimate that bounds the execution time 99% of the time may be more useful for a designer in a soft real-time environment. This paper discusses an approach to measure the execution time distribution by a hardware simulator, and a path-based timing analysis approach to derive a static estimation of this same distribution. The technique can find a soft WCET for loops having any number of paths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Experiments with Symbolic Loop Bound Computation for WCET Analysis1

We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...

متن کامل

The Auspicious Couple: Symbolic Execution and WCET Analysis

We have recently shown that symbolic execution together with the implicit path enumeration technique can successfully be applied in the Worst-Case Execution Time (WCET) analysis of programs. Symbolic execution offers a precise framework for program analysis and tracks complex program properties by analyzing single program paths in isolation. This path-wise program exploration of symbolic execut...

متن کامل

Comparison of Implicit Path Enumeration and Model Checking Based WCET Analysis

In this paper, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it simplifies accurate modeling of pipelines and caches. Experimental results using the UPPAAL model checker indicate that m...

متن کامل

Transformation of Path Information for WCET Analysis during Compilation

Performing worst case execution time WCET analysis on machine code with program path annota tion provided at high level source code level requires the transformation of path annotations from the source code level to assembly object code level This path information transformation can be done outside or in tegrated into the compiler during code compilation The rst approach is easier to implement ...

متن کامل

ILP-Based Interprocedural Path Analysis

Program analysis usually works on control flow graphs (CFGs) and on a call graph (CG). The standard CGs contain one node for each function, but for precise analyses, it may be desirable to distinguish function invocations by their execution history. This distinction is useful, e.g., to improve the precision of worst-case execution time (WCET) analysis for real-time systems. Our WCET analysis su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009